Independence number and vertex-disjoint cycles
نویسندگان
چکیده
منابع مشابه
Independence number and vertex-disjoint cycles
In this paper we consider graphs which have no k vertex-disjoint cycles. For given integers k, let f (k, ) be the maximum order of a graph G with independence number (G) , which has no k vertex-disjoint cycles. We prove that f (k, ) = 3k + 2 − 3 if 1 5 or 1 k 2, and f (k, ) 3k + 2 − 3 in general. We also prove the following results: (1) there exists a constant c (depending only on ) such that f...
متن کاملNote on Vertex-Disjoint Cycles
Häggkvist and Scott asked whether one can find a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains vertex-disjoint cycles of k consecutive even lengths. In this paper, it is shown that if G is a graph of average degree at least k + 19k + 12 and sufficiently many vertices, then G contains vertex-disjoint cycles of k consecutive even lengths, answe...
متن کاملVertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case when the physical network is T (n), a torus of size n by n, the subnetworks are cycles and the communication scheme is all-to-all or total exchange (where all pairs of vertices communicate). We will r...
متن کاملVertex-Disjoint Cycles Containing Prescribed Verticesy
Enomoto [7] conjectured that if the minimum degree of a graph G of order n 4k 1 is at least the integer ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi n þ ð 94 k2 4k þ 1Þ q þ j 3 2 k 1 k , then for any k vertices, G contains k vertex-disjoint cycles each of —————————————————— yPart of the research was done during Yoshi...
متن کاملPacking disjoint cycles over vertex cuts
For a graph G, let ν(G) and ν ′(G) denote the maximum cardinalities of packings of vertex-disjoint and edge-disjoint cycles of G, respectively. We study the interplay of these two parameters and vertex cuts in graphs. If G is a graph whose vertex set can be partitioned into three non-empty sets S, V1, and V2 such that there is no edge between V1 and V2, and k = |S|, then our results imply that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.086